A decomposition-based heuristic for a multicrew coordinated road restoration problem

Natural disasters disrupt the connectivity of road networks by blocking segments, which impedes efficient distribution relief materials to affected area. We study problem finding coordinated paths for clearing teams so that network is regained in shortest time. provide an novel heuristic algorithm this problem. In our algorithm, first pre-processed define a binary generate initial solutions, and then several rich problem-specific neighborhood search moves are applied improve derived solutions. analytical results facilitate design algorithm. The performance proposed assessed different numerical experiments, comparison with existing algorithms from literature using instances Istanbul networks. demonstrate performs notably better, both terms speed, proximity optimal solution.